#include<iostream>
#include<cstring>
#include<cstdlib>
#define maxn 1000
//这道题中间不能有注释
using namespace std;
int a[maxn], b[maxn];
void mul(char str1[], char str2[])

{
	int i = 0, j = 0;
	int len1 = strlen(str1);
	int len2 = strlen(str2);

	for (i = len1 - 1, j = 0; i >= 0; i--)
		a[j++] = str1[i] - '0';

	for (i = len2 - 1, j = 0; i >= 0; i--)
		b[j++] = str2[i] - '0';
	//
	// 
	// 
	// 
	//
	int c[maxn] = { 0 };
	for (int i = 0; i < len1; i++)
	{
		for (int j = 0; j < len2; j++)
		{
			c[i + j] += (a[i] * b[j]) % 10;
			c[i + j + 1] += (a[i] * b[j]) / 10;
		}
	}
	for (int i = 0; i < maxn - 1; i++)
	{
		for (; c[i] / 10 != 0;)
		{
			c[i] = c[i] - 10;
			c[i + 1] = c[i + 1] + 1;
		}
	}
	int test = 0;
	for (int i = maxn - 1; i >= 0; i--)
	{

		for (; i > 0;)
		{
			if (c[i] == 0 && test == 0)i--;
			else
			{
				test = 1;
				break;
			}
		}
		if (test == 0)cout << 0;
		else
		{
			cout << c[i];
		}
	}

	//
// 
//
// 
// 
//  
// 
//
}



int main(void)

{
	char str1[maxn], str2[maxn];
	cin >> str1 >> str2;
	mul(str1, str2);
	return 0;

}